Interpreted Logical Forms

نویسندگان

  • Richard K. Larson
  • Peter Ludlow
  • PETER LUDLOW
چکیده

ing from details, what is crucial to note in (42) is the presence of the event variable e, which ranges over acts of demonstration or reference by the speaker. Under B?rge 's account, the semantic value of a demonstrative NP like that dog involves not only an object x but also an event e; that is, such expressions are relational, taking pairs (x, e) as their semantic values.16 Given this reanalysis of the semantic value for demonstratives, distinct T-sentences for (39) can now be assigned in the two situations described above. These will involve sub ILFs for the demonstratives that do not differ in their linguistic form (that planet), or in the object demonstrated (Venus); but do differ in the second member of the pair (x, e). Each demonstrative will involve a different event, corresponding to a different act of demonstration:17 (43)a. <NP,<v,e? b. (NP,(v,e')) I I (that planet, (v, e)) (that planet, (v, e')) If this proposal is on the right track, then examples like (39) represent another case of attitudes distinguished by content. 3.3. Logically Equivalent Attitude Reports Although (14)-(16) impose rather strict conditions on the logical equiv alence of attitude reports, equivalence nonetheless is still possible in certain cases within the ILF theory. In particular, two distinct attitude reports a and ? will be logically equivalent when the following two conditions are met: (i) the values assigned to the subparts of the comple ment clauses of a and ? are identical (that is, a and ? differ at most in the forms of (some of) their subconstituent parts); and (ii) a and ? are evaluated under structures in which their formally distinct (but coreferring) subparts are given scope out of the complement clauses, beyond the highest attitude verb. We illustrate once again with (2a,b). In the discussion above we considered LF representations of sentences in which their proper name subjects were confined to the subordinate clause. Suppose, however, that these sentences are assigned LFs in which the subordinate subject is optionally given broad scope: (44)a. [NP Judy Garland^ [Max believes [tx sang "Somewhere Over the Rainbow"]]. INTERPRETED LOGICAL FORMS 323 b. [Np Frances Gumm]i [Max believes [tt sang "Somewhere Over the Rainbow"]]. The clausal complements are now formally identical, both having the form: h sang "Somewhere Over the Rainbow". Furthermore, the sem antic value assigned to the trace h will be the same in both cases: tx will denote the individual Judy Garland/Frances Gumm. Accordingly, the T-sentences for (2a) and (2b) will be identical, requiring Max to stand in the believe-relation to one and the same object (45) :18

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A duality between LM-fuzzy possibility computations and their logical semantics

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

متن کامل

Two Sorts of Claims about " Logical Form " *

The notion of logical form broadly construed has been central to the enterprise of analytic philosophy. Indeed, much of what we call analytic philosophy can be understood as something like the attempt to " characterize the logical forms " of various classes of sentences. Thus metaethical investigations into the nature of moral goodness can be thought of as attempts to " characterize the logical...

متن کامل

Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refinements are bidirectional, leading to a straightforward proof of decidability of ty...

متن کامل

Control Interpreted Petri Nets – Model Checking and Synthesis

The chapter presents a novel approach to formal verification of logic controller programs [2], focusing especially on reconfigurable logic controllers (RLCs). Control Interpreted Petri Nets [8] are used as formal specification of logic controller behavior. The approach proposes to use an abstract rule-based logical model presented at RTL-level. A Control Interpreted Petri Net is written as a lo...

متن کامل

Believing the Unbelievable: the Dilemma of Self-Belief∗

In this paper, ‘procedural rationality’ is interpreted to be the ability to state one’s own beliefs, and make decisions through logical deductions. We show that if a beliefsystem is consistent, deductively closed, and contains arithmetic, then two forms of self-belief— the ability to define one’s own belief-system and the Principle of Positive Introspection, become irreconcilable. This shows th...

متن کامل

Lenny Clapp Davidson’s Program and Interpreted Logical Forms

The “Interpreted Logical Form” (ILF) analysis of attitude ascriptions has been proffered, most notably by Higginbotham (1986) and Larson and Ludlow (1993), as a means of resolving within the framework of Davidson’s semantic program the familiar problems posed by attitude ascriptions.1 In this paper I argue that only an analysis of attitude ascriptions along the lines of Davidson’s (1968) “parat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008